Morphing Stick Figures Using Optimized Compatible Triangulations
نویسندگان
چکیده
A “stick figure” is a connected straight-line plane graph, sometimes called a “skeleton”. Compatible stick figures are those with the same topological structure. We present a method for naturally morphing between two compatible stick figures in a manner that preserves compatibility throughout the morph. In particular, this guarantees that the intermediate shapes are also stick figures (e.g. they do not self-intersect). Our method generalizes existing algorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by reducing the number of Steiner vertices used.
منابع مشابه
Intrinsic Morphing of Compatible Triangulations
Two planar triangulations with a correspondence between two vertex sets are compatible (isomorphic) if they are topologically equivalent. This work presents a simple and robust method for morphing two compatible planar triangulations with identical convex boundaries that locally preserves the intrinsic geometric properties of triangles throughout the morph. The method is based on the barycentri...
متن کاملOn Compatible Triangulations with a Minimum Number of Steiner Points
Two vertex-labelled polygons are compatible if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations—for every face, the clockwise cyclic order of vertices on the boundary must be the same. It is known that every pair of compatible n-vertex polygonal regions can be extended to compatible triangulations b...
متن کاملPolygon Morphing and Its Application in Orebody Modeling
Three different polygon morphing methods are examined. The first one is based on the utilization of the trimmed skeleton of the symmetric difference of the source and target polygons as an intermediate polygon. The second one reduces the problem to the problem of morphing compatible planar triangulations and utilizes the representation of planar triangulations as a matrix constructed using bary...
متن کاملIntersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar graphs. Our algorithm uses a combination of different techniques to achieve smooth transformations: rigid morphing, compatible triangulations, as well as morphing based on interpolation of the convex repr...
متن کاملGuaranteed intersection-free polygon morphing
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by r...
متن کامل